Geometrically uniform hyperbolic codes
نویسندگان
چکیده
In this paper we generalize the concept of geometrically uniform codes, formerly employed in Euclidean spaces, to hyperbolic spaces. We also show a characterization of generalized coset codes through the concept of G-linear codes. Mathematical subject classification: 14L35, 94B60.
منابع مشابه
Geometrically uniform TCM codes over groups based on L × MPSK constellations
The theory of geometrically uniform signal sets and codes over groups is applied to the case of LxMPSK constellations. Conditions for rotational invariance of group codes are discussed. The tables of geometrically uniform partitions recently found in [l] are used to construct good geometrically uniform trellis codes over nonbinary Abelian groups. We consider Lx4PSK and Lx8PSK constellations use...
متن کاملGeometrically uniform partitions of L×MPSK constellations and related binary trellis codes
The recently developed theory of geometrically uniform trellis codes is applied to the case of multidimensional PSK constellations. The symmetry group of an L X MPSK constellation is completely characterized. Conditions for rotational invariance of geometrically uniform partitions of a signal constellation are given. Through suitable algorithms, geometrically uniform partitions of L X MPSK ( M ...
متن کاملSOLVING LINEAR SIXTH-ORDER BOUNDARY VALUE PROBLEMS BY USING HYPERBOLIC UNIFORM SPLINE METHOD
In this paper, a numerical method is developed for solving a linear sixth order boundaryvalue problem (6VBP ) by using the hyperbolic uniform spline of order 3 (lower order). Thereis proved to be first-order convergent. Numerical results confirm the order of convergencepredicted by the analysis.
متن کاملNUMERICAL SOLUTIONS OF SECOND ORDER BOUNDARY VALUE PROBLEM BY USING HYPERBOLIC UNIFORM B-SPLINES OF ORDER 4
In this paper, using the hyperbolic uniform spline of order 4 we develop the classes of methods for the numerical solution of second order boundary value problems (2VBP) with Dirichlet, Neumann and Cauchy types boundary conditions. The second derivativeis approximated by the three-point central difference scheme. The approximate results, obtained by the proposed method, confirm theconvergence o...
متن کاملA New Decoding Algorithm for Geometrically Uniform Trellis Codes - Communications, IEEE Transactions on
A new decoding algorithm for geometrically uniform trellis codes is presented. The group structure of the codes is exploited in order to improve the decoding process. Analytical bounds to the algorithm performance and to its computational complexity are derived. The algorithm complexity does not depend on the number of states of the trellis describing the code. Extensive simulations yield resul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005